LP-Decodable Permutation Codes Based on Linearly Constrained Permutation Matrices

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On optimal permutation codes

Permutation codes are vector quantizers whose codewords are related by permutations and, in one variant, sign changes. Asymptotically, as the vector dimension grows, optimal Variant I permutation code design is identical to optimal entropy-constrained scalar quantizer (ECSQ) design. However, contradicting intuition and previously published assertions, there are finite block length permutation c...

متن کامل

Lp-norm Regularization Algorithms for Optimization Over Permutation Matrices

Optimization problems over permutation matrices appear widely in facility layout, chip design, scheduling, pattern recognition, computer vision, graph matching, etc. Since this problem is NP-hard due to the combinatorial nature of permutation matrices, we relax the variable to be the more tractable doubly stochastic matrices and add an Lp-norm (0 < p < 1) regularization term to the objective fu...

متن کامل

Permutation codes

There are many analogies between subsets and permutations of a set, and in particular between sets of subsets and sets of permutations. The theories share many features, but there are also big differences. This paper is a survey of old and new results about sets (and groups) of permutations, concentrating on the analogies and on the relations to coding theory. Several open problems are describe...

متن کامل

A Bound on Permutation Codes

Consider the symmetric group Sn with the Hamming metric. A permutation code on n symbols is a subset C ⊆ Sn. If C has minimum distance > n − 1, then |C| 6 n2 − n. Equality can be reached if and only if a projective plane of order n exists. Call C embeddable if it is contained in a permutation code of minimum distance n−1 and cardinality n2−n. Let δ = δ(C) = n2−n−|C| be the deficiency of the per...

متن کامل

Linearly decodable functions from neural population codes

The population vector is a linear decoder for an ensemble of neurons, whose response properties are nonlinear functions of the input vector. However, previous analyses of this decoder seem to have missed the obsevation that the population vector can also be used to estimate functions of the input vector. We explore how to use singular value decomposition to delineate the class of functions whic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2012

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2012.2196253